On the limit of large girth graph sequences
نویسندگان
چکیده
منابع مشابه
On the limit of large girth graph sequences
Let d ≥ 2 be given and let μ be an involution-invariant probability measure on the space of trees T ∈ Td with maximum degrees at most d. Then μ arises as the local limit of some sequence {Gn} ∞ n=1 of graphs with all degrees at most d. This answers Question 6.8 of Bollobás and Riordan [4].
متن کاملOn the girth of the annihilating-ideal graph of a commutative ring
The annihilating-ideal graph of a commutative ring $R$ is denoted by $AG(R)$, whose vertices are all nonzero ideals of $R$ with nonzero annihilators and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=0$. In this article, we completely characterize rings $R$ when $gr(AG(R))neq 3$.
متن کاملthe effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill
this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...
15 صفحه اولsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولOn Approximating the d-Girth of a Graph
For a finite, simple, undirected graph G and an integer d ≥ 1, a mindeg-d subgraph is a subgraph of G of minimum degree at least d. The dgirth of G, denoted gd(G), is the minimum size of a mindeg-d subgraph of G. It is a natural generalization of the usual girth, which coincides with the 2-girth. The notion of d-girth was proposed by Erdős et al. [13, 14] and Bollobás and Brightwell [7] over 20...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2010
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-010-2559-2